Particle Swarm Optimization Algorithm for the Shortest Confidence Interval Problem
نویسندگان
چکیده
Based on the example of constructing a confidence interval for variance, the notion and construction of the shortest confidence interval are put forward. Furthermore, the particle swarm algorithm for this problem is presented to solve this non-linear programming problem. Compared with the confidence interval calculated with traditional method, it has distinct advantage. The optimum results which is used to find the shortest confidence interval of variance and mean variance are given under the confidence level 0.9 and 0.95. The shortest confidence interval about Gamma distribution, Laplace distribution, Weibull distribution and beta distribution are also discussed.
منابع مشابه
Optimization of Dogleg Severity in Directional Drilling Oil Wells Using Particle Swarm Algorithm (Short Communication)
The dogleg severity is one of the most important parameters in directional drilling. Improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. Selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...
متن کاملEconomic Dispatch of Thermal Units with Valve-point Effect using Vector Coevolving Particle Swarm Optimization Algorithm
Abstract: This paper is intended to reduce the cost of producing fuel from thermal power plants using the problem of economic distribution. This means that in order to determine the share of each unit, considering the amount of consumption and restrictions, including the ones that can be applied to the rate of increase, the prohibited operating areas and the barrier of the vapor barrier, the pr...
متن کاملAn improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 7 شماره
صفحات -
تاریخ انتشار 2012